Application of Shortest Path Search Algorithm in Disaster Decision Support System
نویسندگان
چکیده
Core setting region could facilitate disaster relief and strength communication among setting regions when emergent disaster happens. Shortest path search algorithms could be applied. Dijkstra algorithm is discussed and is improved to solve the confirmation of core setting region. It ensures that the core setting region is the nearest to the farthest region. The improved algorithm turns out to be practical.
منابع مشابه
Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملThe Urban Path Routing Adjustable Optimization by Means of Wavelet Transform and Multistage Genetic Algorithm
This paper introduces the optimization algorithm to improve search rate in urban path routing problems using viral infection and local search in urban environment. This algorithm operates based on two different approaches including wavelet transform and genetic algorithm. The variables proposed by driver such as degree of difficulty and difficulty traffic are of the essence in this technique. W...
متن کاملA GIS-based Dynamic Shortest Path Determination in Emergency Vehicles
Accomplishing an effective routing of emergency vehicle will minimize its response time and will thus improve the response performance. Traffic congestion is a critical problem in urban area that influences the travel time of vehicles. The aim of this study is developing a spatial decision support system (SDSS) for emergency vehicle routing. The proposed system is based on integration of geospa...
متن کاملApplication of A Route Expansion Algorithm for Transit Routes Design in Grid Networks
Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...
متن کامل